Behavioural Notions for Elementary Net Systems

Elementary Net Systems

Subobject Transformation Systems and Elementary Net Systems

Graph transformation systems (GTSs) [10] are a powerful specification formalism for concurrent and distributed systems, generalising another classical model of concurrency, namely Place/Transition Petri nets [8]. Along the years, the concurrent behaviour of GTSs has been deeply studied and a consolidated theory of concurrency is now available. In particular, by exploiting the relationship with ...

The Synthesis Problem for Elementary Net Systems is NP-Complete

The so-called synthesis problem consists in deciding for a class of nets whether a given graph is isomorphic to the case graph of some net and then constructing the net. This problem has been solved for various classes of nets, ranging from elementary nets to Petri nets. The general principle is to compute regions in the graph, i.e. subsets of nodes liable to represent extensions of places of a...

Bounded Parametric Model Checking for Elementary Net Systems

Bounded Model Checking (BMC) is an efficient verification method for reactive systems. BMC has been applied so far to verification of properties expressed in (timed) modal logics, but never to their parametric extensions. In this talk we show, for the first time, that BMC can be extended to PRTECTL – the parametric extension of the existential version of CTL. To this aim we define a bounded sem...

Variable Structure Behavioural Controller for Multi-agent Systems

In previous papers authors have considered agents as inertia-less self driven particles and designed a flocking algorithm. Application of this algorithm to agents with considerable inertial characteristics needs a behavioural controller. The controller uses the local information and helps every agent to imitate the desired behaviour as a member of the flocking frame which covers the main is...